Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

Parallel branch and cut for capacitated vehicle routing

Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge. In more sophisticated variants, such as b...

Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems

This article presents techniques for constructing robust Branch-Cutand-Price algorithms on a number of Vehicle Routing Problem variants. The word “robust” stress the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the d...

A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles

A R T I C L E I N F O Vehicle routing problem, Multiple use of vehicles, Mixed integer programming formulation, Branchand-cut algorithm, Simulated annealing Received 11 March 2015 Accepted 22 May 2015 Available online 1 June 2015 This paper addresses the vehicle routing problem with multiple use of vehicles (VRPMUV), an important variant of the classic vehicle routing problem (VRP). Unlike the ...

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum cost tree including exactly one vertex per cluster. Applications of the GMSTP are encountered in telecommunications. An integer linear programming formulation is presented ...